A Grid-Based Inverted Generational Distance for Multi/Many-Objective Optimization

نویسندگان

چکیده

Assessing the performance of Pareto front (PF) approximations is a key issue in field evolutionary multi/many-objective optimization. Inverted generational distance (IGD) has been widely accepted as indicator for evaluating comprehensive quality PF approximation. However, IGD usually becomes infeasible when facing real-world optimization problem it needs to know true priori. In addition, time complexity grows quadratically with size solution/reference set. To address aforementioned issues, grid-based (Grid-IGD) proposed estimate both convergence and diversity Grid-IGD, set reference points generated by estimating PFs question, based on representative nondominated solutions all grid environment. reduce complexity, Grid-IGD only considers closest solution within neighborhood approximation every point. also possesses other desirable properties, such compliance, immunity dominated/duplicate solutions, no need normalization. experimental studies, verified artificial real obtained five many-objective optimizers. Effects specification behavior are discussed detail theoretically experimentally.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Empirical Assessment of the Properties of Inverted Generational Distance on Multi- and Many-Objective Optimization

The inverted generational distance (IGD) is a metric for assessing the quality of approximations to the Pareto front obtained by multi-objective optimization algorithms. The IGD has become the most commonly used metric in the context of many-objective problems, i.e., those with more than three objectives. The averaged Hausdorff distance and IGD are variants of the IGD proposed in order to overc...

متن کامل

Reference Point Based Multi-Objective Optimization to Workflow Grid Scheduling

Grid provides global computing infrastructure for users to avail the services supported by the network. The task scheduling decision is a major concern in heterogeneous grid computing environment. The scheduling being an NP-hard problem, meta-heuristic approaches are preferred option. In order to optimize the performance of workflow execution two conflicting objectives, namely makespan (executi...

متن کامل

A New Approach Applying Multi-objective Optimization using a Taguchi Fuzzy-based for Tourist Satisfaction Management

The paper describes the usage of the fuzzy Mamdani analysis and Taguchi method to optimize the tourism satisfaction in Thailand. The fuzzy reasoning system is applied to pursue the relationships among the options of a tour company in order to be used in Taguchi experiments as the responses. In this research, tourism satisfaction is carried out using L18 Taguchi orthogonal arrays on parameters s...

متن کامل

Multi-Objective Optimization using Grid Computing

This paper analyzes some technical and practical issues concerning the use of parallel systems to solve multiobjective optimization problems using enumerative search. This technique constitutes a conceptually simple search strategy, and it is based on evaluating each possible solution from a given finite search space. The results obtained by enumeration are impractical for most computer platfor...

متن کامل

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2021

ISSN: ['1941-0026', '1089-778X']

DOI: https://doi.org/10.1109/tevc.2020.2991040